Labelling systems and R.E. structures

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Finite Labelling Problem in Event Structures

In event structures, one of the classical models of parallelism, the concept of nice labelling occurs: this consists in attributing label to each event of the structure, in such a way that two different events may have the same label if either they are in temporal causality or they are not the initial occurrences of incompatible actions. The problem is to minimize the number of labels. In this ...

متن کامل

Recursive Labelling Systems and Stability of Recursive Structures in Hyperarithmetical Degrees

We show that, under certain assumptions of recursiveness in 21, the recursive structure 21 is A^-stable for a < wfK if and only if there is an enumeration of 21 using a E^ set of recursive EQ infinitary formulae and finitely many parameters from 21. This extends the results of [1]. To do this, we first obtain results concerning A^ paths in recursive labelling systems, also extending results of ...

متن کامل

Detecting and Labelling Wireless Community Network Structures from Eigen-spectra

Wireless and ad hoc networks often have local regions of highly intra-connected modules or communities of nodes against a backdrop of sparser longer-range intercommunity connectivities. We report on empirical observations and a prototype algorithm for correctly counting and labelling the number of dense community structures or modules within a fully connected network. We describe the eigen-spec...

متن کامل

Combinatorics from Concurrency: the Nice Labelling Problem for Event Structures∗

An event structures is a mathematical model of a concurrent process. It consists of a set of local events ordered by a causality relation and separated by a conflict relation. A global state, or configuration, is an order ideal whose elements are pairwise not in conflict. Configurations, ordered by subset inclusion, form a poset whose Hasse diagram codes the state-transition graph of the proces...

متن کامل

Fully-Automatic Branch Labelling of Voxel Vessel Structures

Today, it is possible to acquire volume representations of the vessel structures in the brain. The selfadjusting probe, a new tool introduced in a previous paper, enables semi-automatic shape extraction. The self-adjusting probe extracts shapes from a surface model. Yet, if two vessel branches are close together, it is possible that surface vertices of a neighbor vessel are included in the set ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Annals of Pure and Applied Logic

سال: 1990

ISSN: 0168-0072

DOI: 10.1016/0168-0072(90)90065-a